Kurepa trees and Namba forcing

نویسندگان

  • Bernhard König
  • Yasuo Yoshinobu
چکیده

We show that compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily large λ. This is done by adding ‘regressive’ λ-Kurepa-trees in either case. We argue that the destruction of regressive Kurepa-trees with MM requires the use of Namba forcing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Can a Small Forcing Create Kurepa Trees

In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an ω1-preserving forcing notion of size at most ω1. In the first section we show that in the Lévy model obtained by collapsing all cardinals between ω1 and a strongly inaccessible cardinal by forcing with a countable support Lévy collapsing order many ω1preserving fo...

متن کامل

More on Almost Souslin Kurepa Trees

It is consistent that there exists a Souslin tree T such that after forcing with it, T becomes an almost Souslin Kurepa tree. This answers a question of Zakrzewski [6].

متن کامل

The Di erences Between Kurepa Trees And Jech

By an !1{tree we mean a tree of power !1 and height !1. An !1{tree is called a Kurepa tree if all its levels are countable and it has more than !1 branches. An !1{tree is called a Jech{Kunen tree if it has branches for some strictly between !1 and 2 !1 . In x1, we construct a model of CH plus 21 > !2, in which there exists a Kurepa tree with no Jech{Kunen subtrees and there exists a Jech{Kunen ...

متن کامل

A Model in Which There Are Jech–kunen Trees but There Are No Kurepa Trees

By an ω1–tree we mean a tree of power ω1 and height ω1. We call an ω1–tree a Jech–Kunen tree if it has κ–many branches for some κ strictly between ω1 and 21 . In this paper we construct the models of CH plus 21 > ω2, in which there are Jech–Kunen trees and there are no Kurepa trees. An partially ordered set, or poset for short, 〈T,<T 〉 is called a tree if for every t ∈ T the set {s ∈ T : s <T t...

متن کامل

Club degrees of rigidity and almost Kurepa trees

A highly rigid Souslin tree T is constructed such that forcing with T turns T into a Kurepa tree. Club versions of previously known degrees of rigidity are introduced, as follows: for a rigidity property P , a tree T is said to have property P on clubs if for every club set C (containing 0), the restriction of T to levels in C has property P . The relationships between these rigidity properties...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 77  شماره 

صفحات  -

تاریخ انتشار 2012